QUAD: A multivariate stream cipher with provable security
نویسندگان
چکیده
منابع مشابه
QUAD: A Practical Stream Cipher with Provable Security
We introduce a practical synchronous stream cipher with provable security named QUAD. The cipher relies on the iteration of a multivariate quadratic system of m equations in n < m unknowns over a finite field. The security of QUAD is provably reducible to the conjectured intractability of the MQ problem, namely solving a multivariate system of quadratic equations.
متن کاملEfficient implementation for QUAD stream cipher with GPUs
QUAD stream cipher uses multivariate polynomial systems. It has provable security based on the computational hardness assumption. More specifically, the security of QUAD depends on hardness of solving non-linear multivariate systems over a finite field, and it is known as an NP-complete problem. However, QUAD is slower than other stream ciphers, and an efficient implementation, which has a redu...
متن کاملSecurity Weaknesses in a Randomized Stream Cipher
TriStrata appears to have implemented a variation of Maurer’s randomised cipher. We define a variation of Maurer’s cipher that appears to be similar to the TriStrata version, and show several cryptanalytical attacks against our variant.
متن کاملEfficient Parallel Evaluation of Multivariate Quadratic Polynomials on GPUs
QUAD is a provably secure stream cipher, whose security is based on the hardness assumption of solving multivariate quadratic polynomial systems over a finite field, which is known to be NP-complete. However, such provable security comes at a price, and QUAD is slower than most other stream ciphers that do not have security proofs. In this paper, we discuss two efficient parallelization techniq...
متن کاملBMGL: Synchronous Key-stream Generator with Provable Security (Revision 1)
We propose a construction of an efficient, synchronous keystream generator with provable security properties in response to the NESSIE call for primitives. The cryptographic core of the stream cipher is the block cipher Rijndael. We show that a non-trivial attack on the cipher reduces to an attack on Rijndael. The construction uses an optimization of earlier work on pseudorandom generators by B...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2009
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2008.10.004